FRONTAL-SKYLINE METHOD FOR UNSYMMETRIC MATRICES
نویسندگان
چکیده
منابع مشابه
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
A common operation in scientific computing is the multiplication of a sparse, rectangular, or structurally unsymmetric matrix and a vector. In many applications the matrix-transposevector product is also required. This paper addresses the efficient parallelization of these operations. We show that the problem can be expressed in terms of partitioning bipartite graphs. We then introduce several ...
متن کاملEstimation of uTƒ(A)v for large-scale unsymmetric matrices
Fast algorithms, based on the unsymmetric look-ahead Lanczos and the Arnoldi process, are developed for the estimation of the functional (f)= uf(A)v for xed u; v and A, where A∈Rn×n is a large7 scale unsymmetric matrix. Numerical results are presented which validate the comparable accuracy of both approaches. Although the Arnoldi process reaches convergence more quickly in some cases, it 9 has ...
متن کاملA two-level sparse approximate inverse preconditioner for unsymmetric matrices
Sparse approximate inverse (SPAI) preconditioners are effective in accelerating iterative solutions of a large class of unsymmetric linear systems and their inherent parallelism has been widely explored. The effectiveness of SPAI relies on the assumption of the unknown true inverse admitting a sparse approximation. Furthermore, for the usual right SPAI, one must restrict the number of non-zeros...
متن کاملBicgstab(l) for Linear Equations Involving Unsymmetric Matrices with Complex
For a number of linear systems of equations arising from realistic problems, using the Bi-CGSTAB algorithm of van der Vorst [17] to solve these equations is very attractive. Unfortunately, for a large class of equations, where, for instance, Bi-CG performs well, the convergence of BiCGSTAB stagnates. This was observed specifically in case of discretized advection dominated PDE’s. The stagnation...
متن کاملImproved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
We present algorithms for the symbolic and numerical factorization phases in the direct solution of sparse unsymmetric systems of linear equations. We have modified a classical symbolic factorization algorithm for unsymmetric matrices to inexpensively compute minimal elimination structures. We give an efficient algorithm to compute a near-minimal data-dependency graph for unsymmetric multifront...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doboku Gakkai Ronbunshu
سال: 1985
ISSN: 0289-7806,1882-7187
DOI: 10.2208/jscej.1985.356_101